The Internet shutdown muzzle(s) freedom of expression in Ethiopia: competing narratives

Freedom of expression is a foundational stone for democracy and embraces a number of other rights, including – freedom to seek, receive, and impart information using any medium. Around 16 million Ethiopians, comprising 15.4% of the total population, use the Internet. The Ethiopian Internet shutdown saga has been marked by competing narratives. On one hand, the government has been using two governing narratives, i.e. national security narrative and ‘economic growth’ narrative to justify shutdowns of the Internet. But, the individuals’ self-expressions on social media find itself as competing narrative. Since 2016, the Internet has been closed more than six times under the cloak of national security, quelling rising protests, controlling strikes, and exam cheating. As such, freedom of expression of millions has been muzzled. The article argues blanket Internet shutdowns do not meet the caveats of human rights law.     

一种快速发现考试作弊信号的方法

简要介绍了基于压缩感知理论,对重构随机出现的考试作弊信号进行了仿真实验,理论实验表明,基于压缩感知理论的信号重构算法可以快速有效的发现随机出现的作弊信号,为后续的阻断工作奠定了基础。     

大学生考试作弊心理干预研究

大学生考试作弊被考务人员发现并形成事实是大学校园客观存在的一种现象,极易引发学生产生严重的心理危机.在总结考试作弊被发现后大学生心理危机特点的基础上,根据心理危机干预原理,提出了考试作弊后心理危机干预的方法和措施.     

大学生考试作弊的心理因素分析

大学生考试作弊行为作为考试行为中的一种特殊行为现象,它是由一定的心理动机支配的。结合心理学相关原理,从气质、性格、道德感、兴趣和价值观等方面来分析大学生考试作弊的心理原因,对抵制、消除大学生作弊行为具有积极的能动效应。     

对一种多重密钥共享认证改进方案的完善

通过分析一种多重密钥共享认证改进方案,指出其中存在的漏洞和防止成员欺骗中存在的问题,提出了自己的完善方案,使其在共享多个密钥、子密钥可以重复使用、防止管理者欺骗及参与成员欺骗等方面更加完善．     

固定组成员的应用层组播树不稳定问题

传统的组播树稳定性研究一般都是基于组播成员的动态变化的.但在应用层组播中,由于组播树的组成节点是应用层的端系统节点,组播成员可以通过欺骗以企图在组播树上占据更有利的位置,从而在组播成员不变时也会造成组播树的不稳定.本文建立了应用层组播节点的欺骗模型,并讨论了在固定组成员的情况下,节点欺骗引起的组播树不稳定问题.模拟实验结果表明,节点欺骗对应用层组播树的稳定性有极大的负面影响.     

大学生的成就动机与作弊行为

从大学生作弊与否的行为来考察其学习动机的差异，并力求使学生通过努力归因形成掌握目标并从根本上减少学生的作弊行为。     

Some remarks on the security of the identification scheme based on permuted kernels

We present in this paper an idea of how to reduce the number of possible permutations when trying to solve the permuted kernels problem. We refer to the identification scheme of Shamir [2] and we also show how a dishonest prover can maximize his prospects to pass the test.     

A Cellular Automata Based Verifiable Multi-secret Sharing Scheme Without a Trusted Dealer

—We proposed a verifiable multi-secret shar-ing scheme without a dealer. We use cellular automata, having the properties of linear computations and parallel computations, to construct our scheme. The linear com-putational property makes it possible to build a scheme without the assistance of a trusted dealer, and the parallel computational property contributes to the high efficiency of the scheme. Hash function is used to realize the verifica-tion of shares, which also makes our scheme more efficient. The security of the scheme is also analyzed.